Robust Non-Rigid Point Set Registration Using Student's-t Mixture Model
نویسندگان
چکیده
The Student's-t mixture model, which is heavily tailed and more robust than the Gaussian mixture model, has recently received great attention on image processing. In this paper, we propose a robust non-rigid point set registration algorithm using the Student's-t mixture model. Specifically, first, we consider the alignment of two point sets as a probability density estimation problem and treat one point set as Student's-t mixture model centroids. Then, we fit the Student's-t mixture model centroids to the other point set which is treated as data. Finally, we get the closed-form solutions of registration parameters, leading to a computationally efficient registration algorithm. The proposed algorithm is especially effective for addressing the non-rigid point set registration problem when significant amounts of noise and outliers are present. Moreover, less registration parameters have to be set manually for our algorithm compared to the popular coherent points drift (CPD) algorithm. We have compared our algorithm with other state-of-the-art registration algorithms on both 2D and 3D data with noise and outliers, where our non-rigid registration algorithm showed accurate results and outperformed the other algorithms.
منابع مشابه
The mixtures of Student's t-distributions as a robust framework for rigid registration
The problem of registering images or point sets is addressed. At first, a pixel similarity-based algorithm for the rigid registration between single and multimodal images is presented. The images may present dissimilarities due to noise, missing data or outlying measures. The method relies on the partitioning of a reference image by a Student’s t-mixture model (SMM). This partition is then proj...
متن کاملGeneralised Coherent Point Drift for Group-Wise Registration of Multi-dimensional Point Sets
In this paper we propose a probabilistic approach to groupwise registration of unstructured high-dimensional point sets. We focus on registration of generalised point sets which encapsulate both the positions of points on surface boundaries and corresponding normal vectors describing local surface geometry. Richer descriptions of shape can be especially valuable in applications involving comple...
متن کاملMulti-scale Non-Rigid Point Cloud Registration Using Robust Sliced-Wasserstein Distance via Laplace-Beltrami Eigenmap
In this work, we propose computational models and algorithms for point cloud registration with non-rigid transformation. First, point clouds sampled from manifolds originally embedded in some Euclidean space RD are transformed to new point clouds embedded in Rn by Laplace-Beltrami(LB) eigenmap using the n leading eigenvalues and corresponding eigenfunctions of LB operator defined intrinsically ...
متن کاملSmooth point-set registration using neighboring constraints
We present an approach for Maximum Likelihood estimation of correspondence and alignment parameters that benefits from the representational skills of graphs. We pose the problem as one of mixture modelling within the framework of the Expectation-Maximization algorithm. Our mixture model encompasses a Gaussian density to model the point-position errors and a Bernoulli density to model the struct...
متن کاملBi-Stage Large Point Set Registration Using Gaussian Mixture Models
Point set registration is to determine correspondences between two different point sets, then recover the spatial transformation between them. Many current methods, become extremely slow as the cardinality of the point set increases; making them impractical for large point sets. In this paper, we propose a bi-stage method called bi-GMMTPS, based on Gaussian Mixture Models and Thin-Plate Splines...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 9 شماره
صفحات -
تاریخ انتشار 2014